Graph operations - PDFSEARCH.IO - Document Search Engine

Graph operations
Results: 797

#	Item
101	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs Nadia M. Benbernou∗ Add to Reading List Source URL: www.eecs.tufts.edu Language: English - Date: 2007-09-02 21:41:50 Planar graphs Graph connectivity Graph operations Dual graph Line segment Cut Convex set Connectivity Graph Bridge Planar separator theorem Circle packing theorem
102	Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro Add to Reading List Source URL: dl.dropboxusercontent.com Language: English Graph theory Graph operations Graph coloring Chordal graph Graph minor Cograph Intersection graph RobertsonSeymour theorem Forbidden graph characterization Clique Pathwidth Line graph
103	COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS WITH MULTIPLICITIES ´n Alexander Barvinok and Pablo Sobero July 2015 Add to Reading List Source URL: www.math.lsa.umich.edu Language: English - Date: 2015-08-02 17:12:20 Graph theory Mathematics NP-complete problems Graph operations Graph coloring Line graph Matching Two-graph Train track map
104	Revealing properties of the bipartite structure of online social networks Raphaël TACKX, Jean-loup GUILLAUME, Add to Reading List Source URL: rcis2015.hua.gr Language: English - Date: 2015-05-25 09:38:28 Network theory Graph theory Operations research Clustering coefficient Social network Assortativity Bipartite graph Complex network Climate as complex networks
105	Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2014-10-22 08:43:20 Graph theory Mathematics NP-complete problems NP-hard problems Operations research Travelling salesman problem Matching Eulerian path Hamiltonian path Minimum spanning tree Cycle Line graph
106	Overlapping Community Detection Using Seed Set Expansion Joyce Jiyoung Whang David F. Gleich Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2013-09-05 18:39:07 Graph theory Mathematics Algebraic graph theory Network analysis Graph connectivity Networks Graph operations Line graph Conductance Clique Community structure Graph partition
107	Discrete Tabu Search for Graph Matching Kamil Adamczewski Yumin Suh Add to Reading List Source URL: www.cv-foundation.org Language: English - Date: 2015-10-24 14:55:30 Graph theory Mathematics Metaheuristics Operations research Combinatorial optimization Computational complexity theory Local search Tabu search Matching Mathematical optimization Heuristic Search algorithm
108	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-09 09:55:11 Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition
109	Routing by Landmarks Urs-Jakob Rüetschi, University of Zurich David Caduff, University of Zurich Frank Schulz, University of Karlsruhe Alexander Wolff, University of Karlsruhe Sabine Timpf, University of Zurich Add to Reading List Source URL: www.strc.ch Language: English - Date: 2008-11-28 02:18:19 Graph theory Mathematics Discrete mathematics Routing algorithms Edsger W. Dijkstra Network theory Operations research Search algorithms Shortest path problem A* search algorithm Graph Node
110	Recognizing k-equistable graphs in FPT time? Eun Jung Kim1 , Martin Milaniˇc2 , and Oliver Schaudt3 1 3 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-26 04:11:59 Graph theory Graph operations NP-complete problems Graph coloring Cograph Clique Matching Pathwidth